JProver : Integrating Connection-Based Theorem Proving into Interactive Proof Assistants
نویسندگان
چکیده
R. Gore, A. Leitsch, T. Nipkow, eds. International Joint Conference on Automated Reasoning (IJCAR 2001), LNAI 2083, pp. 421–426, c ©Springer Verlag, 2001. Abstract. JProver is a first-order intuitionistic theorem prover that creates sequent-style proof objects and can serve as a proof engine in interactive proof assistants with expressive constructive logics. This paper gives a brief overview of JProver’s proof technique, the generation of proof objects, and its integration into the Nuprl proof development system.
منابع مشابه
Connection-based Theorem Proving in Classical and Non-classical Logics
We present a uniform procedure for proof search in classical logic, intuitionistic logic, various modal logics, and fragments of linear logic. It is based on matrix characterizations of validity in these logics and extends Bibel’s connection method, originally developed for classical logic, accordingly. Besides combining a variety of different logics it can also be used to guide the development...
متن کاملMatrix-based Constructive Theorem Proving
Formal methods for program verification, optimization, and synthesis rely on complex mathematical proofs, which often involve reasoning about computations. Because of that there is no single automated proof procedure that can handle all the reasoning problems occurring during a program derivation or verification. Instead, one usually relies on proof assistants like NuPRL (Constable et al., 1986...
متن کاملAutomating Theorem Proving with SMT
The power and automation offered by modern satisfiability-modulotheories (SMT) solvers is changing the landscape for mechanized formal theorem proving. For instance, the SMT-based program verifier Dafny supports a number of proof features traditionally found only in interactive proof assistants, like inductive, co-inductive, and declarative proofs. To show that proof tools rooted in SMT are gro...
متن کاملTowards the Integration of an Intuitionistic First-Order Prover into Coq
Sledgehammer [11] and HOLyHammer [5] drastically improved the productivity for users of proof assistants. They make the capabilities of automated theorem provers (ATPs) available from within interactive proof assistants. The large, monolithic design of state-of-the-art theorem provers can not be easily trusted to be free of bugs. Thus invoking theorem provers as an oracle is unacceptable for mo...
متن کاملGoing Polymorphic - TH1 Reasoning for Leo-III
While interactive proof assistants for higher-order logic (HOL) commonly admit reasoning within rich type systems, current theorem provers for HOL are mainly based on simply typed λ-calculi and therefore do not allow such flexibility. In this paper, we present modifications to the higher-order automated theorem prover Leo-III for turning it into a reasoning system for rank-1 polymorphic HOL. To...
متن کامل